COMPUTER SIMULATION MODEL OF A COMPUTER NETWORK WITH FRACTAL TRAFFIC FOR TESTING ROUTING ALGORITHMS


 The object of research in this article is simulation modeling a computer network and the process traffic routing. relevance due to importance ensuring quality service networks, particular, by necessity reducing number lost IP-packets at high intensity values. Determining routing packets complex based on various indicators or combinations indicators. If takes place dynamic mode, then complexity route calculation increases, case, one tools for comparison different algorithms can be model network. goal work development testing algorithms. tasks: develop generate structure simulate distribution with ability test Research methods: theory fractal analysis, object-oriented programming, data structures, Markov processes. Conclusions. paper investigated basic principles networks. A has been developed. method networks developed Theory analysis processes are used generation. series experiments was conducted determine how dimensions values affect packets, therefore service. Analyzing results experiment, following conclusions drawn: least occurs when random weak trends. fewest were dimension 1.5, i.e., completely random, there also few close this; persistent anti-persistent (those memory) cause more packet loss same maximum sent from device per unit time. Moreover, significantly losses than ones. Thus, performing finding optimal paths sending IP-packets, it useful take into account entrance each router use calculating metrics best routes.